An improved algorithm to smooth graded quadrilateral meshes preserving the prescribed element size
نویسندگان
چکیده
منابع مشابه
Quadrilateral and Hexahedral Element Meshes
This chapter explains techniques for the generation of quadrilateral and hexahedral element meshes. Since structured meshes are discussed in detail in other parts of this volume, we focus on the generation of unstructured meshes, with special attention paid to the 3D case. Quadrilateral or hexahedral element meshes are the meshes of choice for many applications, a fact that can be explained emp...
متن کامل“CleanUp: Improving Quadrilateral Finite Element Meshes”
Unless an all quadrilateral (quad) finite element mesher is of a high quality, the mesh it produces can contain misshapen quads. This paper will describe “CleanUp”, written to improve an all quad mesh. CleanUp looks at improving node connectivity, boundary and flange patterns, quad shape, and to some extent, quad size. CleanUp is currently used in conjunction with the Paver algorithm developed ...
متن کاملConvergence of an adaptive finite element method on quadrilateral meshes
We prove convergence and optimal complexity of an adaptive finite element algorithm on quadrilateral meshes. The local mesh refinement algorithm is based on regular subdivision of marked cells, leading to meshes with hanging nodes. In order to avoid multiple layers of these, a simple rule is defined, which leads to additional refinement. We prove an estimate for the complexity of this refinemen...
متن کاملConstrained quadrilateral meshes of bounded size
We introduce a new algorithm to convert triangular meshes of polygonal regions, with or without holes, into strictly convex quadrilateral meshes of small bounded size. Our algorithm includes all vertices of the triangular mesh in the quadrilateral mesh, but may add extra vertices (called Steiner points). We show that if the input triangular mesh has t triangles, our algorithm produces a mesh wi...
متن کاملMeshes Preserving Minimum Feature Size
The minimum feature size of a planar straight-line graph is the minimum distance between a vertex and a nonincident edge. When a polygon is partitioned into a mesh, the degradation is the ratio of original to final minimum feature size. We show that some planar straight-line graphs cannot be triangulated with constant degradation, even with an unbounded number of Steiner points and triangles. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Numerical Methods in Engineering
سال: 2001
ISSN: 1069-8299,1099-0887
DOI: 10.1002/1099-0887(200102)17:2<89::aid-cnm357>3.0.co;2-e